package leetcode.bitoperation;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class hierarchical {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        long n =scanner.nextLong();
        List<Long> list = new ArrayList<>();
        while (n!=0){
            long m = n & (~n+1);
            list.add(m);
            n = n-m;
        }
        StringBuffer stringBuffer = new StringBuffer();
        for (int i = list.size()-1; i >=0; i--) {
            int k = 0;
            long l = 1;
            while (l!=list.get(i)){
                l = l<<1;
                k++;
            }
            if (k==1){
                stringBuffer.append("2");
                if (i>0){
                    stringBuffer.append("+");
                }
                continue;
            }else  stringBuffer.append("2(");
            if (k == 0) {
            stringBuffer.append("0)");
                if (i > 0) {
                    stringBuffer.append("+");
                }
            }
            while (k>0){
                while (k>=4){
                    stringBuffer.append("2(");
                    if (k>=8){
                        k=k-8;
                        stringBuffer.append("2+2(0))");
                        if (k!=0){
                            stringBuffer.append("+");
                        }
                        if (k==0){
                            stringBuffer.append(")");
                        }
                    }else {
                        k=k-4;
                        stringBuffer.append("2)");
                        if (k!=0){
                            stringBuffer.append("+");
                        }
                        if (k==0){
                            stringBuffer.append(")");
                        }
                    }
                }
                if (k==1){
                    k=k-1;
                    stringBuffer.append("2(0))");
                }
                if (k==2){
                    k=k-2;
                    stringBuffer.append("2)");
                }
                if (k==3){
                    k=k-3;
                    stringBuffer.append("2+2(0))");
                }
            }

                 if (i>0){
                     stringBuffer.append("+");
                 }
        }

        System.out.println(stringBuffer);
    }
}
